Edge computing server placement with capacitated location allocation

نویسندگان

چکیده

The deployment of edge computing infrastructure requires a careful placement the servers, with an aim to improve application latencies and reduce data transfer load in opportunistic Internet Things systems. In server placement, it is important consider capacity, available budget, hardware requirements for servers underlying backbone network topology. this paper, we thoroughly survey existing literature identify gaps present extensive set parameters be considered. We then develop novel algorithm, called PACK, as capacitated location–allocation problem. PACK minimizes distances between their associated access points, while taking into account capacity constraints balancing enabling workload sharing servers. Moreover, considers practical issues such prioritized locations reliability. evaluate algorithm two distinct scenarios: one high general, low Fog computing. Evaluations are performed collected real-world network, consisting both dense sparse deployments points across city area. resulting related tools publicly open source software.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Capacitated Location-Allocation Problem with Interval Parameters

In this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. We also consider flexibility on distance standard for covering demand nodes by the servers. We use the satisfaction degree to represent the constraint of service capacity. The proposed model belongs to the class of mixed integer programming models. Our model can be redu...

متن کامل

the capacitated location-allocation problem with interval parameters

in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...

متن کامل

Modeling capacitated location – allocation problem with fuzzy demands q

In order to model capacitated location–allocation problem with fuzzy demands, three types of fuzzy programming models – fuzzy expected cost minimization model, fuzzy a-cost minimization model, and credibility maximization model – are proposed according to different decision criteria. For solving these models, some hybrid intelligent algorithms are also designed. Finally, several numerical exper...

متن کامل

Modeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)

The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...

متن کامل

Modeling capacitated location-allocation problem with fuzzy demands

In order to model capacitated location-allocation problem with fuzzy demands, three types of fuzzy programming models — fuzzy expected cost minimization model, fuzzy α-cost minimization model, and credibility maximization model — are proposed according to different decision criteria. For solving these models, some hybrid intelligent algorithms are also designed. Finally, several numerical exper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Parallel and Distributed Computing

سال: 2021

ISSN: ['1096-0848', '0743-7315']

DOI: https://doi.org/10.1016/j.jpdc.2021.03.007